Super-polynomial approximation branching algorithms
نویسندگان
چکیده
منابع مشابه
Super-polynomial approximation branching algorithms
We give sufficient conditions for deriving moderately exponential and/or parameterized time approximation schemata (i.e., algorithms achieving ratios 1± , for arbitrarily small ) for broad classes of combinatorial optimization problems via a well-known technique widely used for deriving exact algorithms, namely the branching tree pruning. Mathematics Subject Classification. 68W25, 05C85, 68Q25....
متن کاملPolynomial-Time Approximation Algorithms
• Assume that the input is random, and find an algorithm that will perform well in the average case. For example, the maximum clique problem, which is NP -hard, can actually be solved efficiently assuming a random input because the maximum clique in a randomly chosen graph is small. This assumption is often used in practice, but the problem is that not everyone will agree on whether the input d...
متن کاملModerate exponential time approximation and branching algorithms
We study links between approximation, exponential time computation and fixed parameter tractability. In particular, rather than focusing on one particular optimization problem, we tackle the question of finding sufficient conditions for a problem to admit “good” approximation algorithms in exponential time. In particular, we focus on the existence of “approximation schemata” (ratios 1 ± ǫ for a...
متن کاملNonlinear piecewise polynomial approximation: Theory and Algorithms
Nonlinear piecewise polynomial approximation: Theory and Algorithms Borislav Karaivanov We study nonlinear n-term approximation in Lp(R) (0 < p < ∞) from Courant elements or (discontinuous) piecewise polynomials generated by multilevel nested triangulations of R which allow arbitrarily sharp angles. To characterize the rate of approximation we introduce and develop three families of smoothness ...
متن کاملApproximation Algorithms for Discrete Polynomial Optimization
In this paper, we consider approximation algorithms for optimizing a generic multivariate polynomial function in discrete (typically binary) variables. Such models have natural applications in graph theory, neural networks, error-correcting codes, among many others. In particular, we focus on three types of optimization models: (1) maximizing a homogeneous polynomial function in binary variable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2016
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/2015060